A maximumb-matching problem arising from median location models with applications to the roommates problem
نویسندگان
چکیده
منابع مشابه
A maximum b-matching problem arising from median location models with applications to the roommates problem
We consider maximum b-matching problems where the nodes of the graph represent points in a metric space, and the weight of an edge is the distance between the respective pair of points. We show that if the space is either the rectilinear plane, or the metric space induced by a tree network, then the b-matching problem is the dual of the (single) median location problem with respect to the given...
متن کاملThe Roommates Problem Discussed
The stable roommates problem as originally posed by Gale and Shapley [1] in 1962 involves a single set of even cardinality 2n, each member of which ranks every other member in order of preference. A stable matching is then a partition of this single set into n pairs such that no two unmatched members both prefer each other to their partners under the matching. However, a simple counterexample q...
متن کاملA Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملThe Popular Roommates problem
We consider the popular matching problem in a roommates instance G = (V,E) with strict preference lists. While popular matchings always exist in a bipartite instance, they need not exist in a roommates instance. The complexity of the popular matching problem in a roommates instance has been an open problem for several years and here we show it is NP-hard. A sub-class of max-size popular matchin...
متن کاملA Multifacility Location Problem on Median Spaces
This paper is concerned with the problem of locating II new facilities in the median space when there are k facilities already located. The objective is to minimize the weighted sum of distances. Necessary and sufficient conditions are established. Based on these results a polynomial algorithm is presented. The algorithm requires the solution of a sequence of minimum-cut problems. The complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1998
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01581725